Representing simple d-dimensional polytopes by d polynomials

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Representing simple d-dimensional polytopes by d polynomials

A polynomial representation of a convex d-polytope P is a finite set {p1(x), . . . , pn(x)} of polynomials over R such that P = ̆ x ∈ R : p1(x) ≥ 0 for every 1 ≤ i ≤ n ̄ . By s(d, P ) we denote the least possible number of polynomials in a polynomial representation of P. It is known that d ≤ s(d, P ) ≤ 2d − 1. Moreover, it is conjectured that s(d, P ) = d for all convex d-polytopes P. We confirm ...

متن کامل

ar X iv : 0 70 9 . 20 99 v 1 [ m at h . M G ] 1 3 Se p 20 07 Representing Simple d - Dimensional Polytopes by d Polynomials ∗

A polynomial representation of a convex d-polytope P is a finite set {p1(x),. .. , pn(x)} of poly-nomials over R d such that P = ˘ x ∈ R d : p1(x) ≥ 0 for every 1 ≤ i ≤ n ¯. By s(d, P) we denote the least possible number of polynomials in a polynomial representation of P. It is known that d ≤ s(d, P) ≤ 2d − 1. Moreover, it is conjectured that s(d, P) = d for all convex d-polytopes P. We confirm...

متن کامل

Counting d-Polytopes with d+3 Vertices

We completely solve the problem of enumerating combinatorially inequivalent d-dimensional polytopes with d + 3 vertices. A first solution of this problem, by Lloyd, was published in 1970. But the obtained counting formula was not correct, as pointed out in the new edition of Grünbaum’s book. We both correct the mistake of Lloyd and propose a more detailed and self-contained solution, relying on...

متن کامل

ON d-DIMENSIONAL COMPACT HYPERBOLIC COXETER POLYTOPES WITH d+ 4 FACETS

We prove that there are no compact Coxeter polytopes with d+4 facets in a hyperbolic space of dimension d > 7. This estimate is sharp: examples of such polytopes in dimensions d ≤ 7 were found by V. O. Bugaenko in 1984. We also show that in dimension 7 there is a unique polytope with 11 facets.

متن کامل

Grid Orientations, (d, d+2)-Polytopes, and Arrangements of Pseudolines

We investigate the combinatorial structure of linear programs on simple d-polytopes with d + 2 facets. These can be encoded by admissible grid orientations. Admissible grid orientations are also obtained through orientation properties of a planar point configuration or by the dual line arrangement. The point configuration and the polytope corresponding to the same grid are related through an ex...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Programming

سال: 2009

ISSN: 0025-5610,1436-4646

DOI: 10.1007/s10107-009-0280-y